Time-varying formation for general linear multi-agent systems via distributed event-triggered control under switching topologies
Wang Jin-Huan1, †, Xu Yu-Ling1, Zhang Jian1, Yang De-Dong2
School of Science, Hebei Provincial Key Laboratory of Big Data Calculation, Hebei University of Technology, Tianjin 300401, China
School of Control Science and Engineering, Hebei University of Technology, Tianjin 300130, China

 

† Corresponding author. E-mail: wjhuan228@163.com

Abstract

This paper investigates the time-varying formation problem for general linear multi-agent systems using distributed event-triggered control strategy. Different from the previous works, to achieve the desired time-varying formation, a distributed control scheme is designed in an event-triggered way, in which for each agent the controller is triggered only at its own event times. The interaction topology among agents is assumed to be switching. The common Lyapunov function as well as Riccati inequality is applied to solve the time-varying formation problem. Moreover, the Zeno behavior of triggering time sequences can be excluded for each agent. Finally, a simulation example is presented to illustrate the effectiveness of the theoretical results.

1. Introduction

In recent years, the research on formation control of multi-agent systems has received significant attention from both scientific and engineering communities, which has great potential applications in broad areas such as load transportation,[1] static and dynamic obstacle avoidance,[2] and unmanned aerial vehicles formation.[35]

Formation control is a significant issue in cooperative control for multi-agent systems. A formation is defined as a predetermined special configuration (such as desired positions or orientations) formed by a cluster of interconnected agents, in which a global goal is achieved cooperatively.[6] Generally speaking, formation can be divided into fixed formation and time-varying formation. Most existing results considered fixed formation control, for example in Refs. [7] and [8] and the literature therein, to name a few. However, in many real applications, the environment may often change and the target is always moving. This motivates several researches on time-varying formation.[911] In addition, the derivative of time-varying formation vector may help to analyze and design the formation control strategy, which is the main difference between fixed formation control and time-varying formation control. Thus it is more utility to study time-varying formation control problem. It is worth mentioning that not all time-varying formation can be directly achieved. Hence a description of the feasible constraints (called the feasibility conditions) for time-varying formation control is usually given.[1113]

Recently, the consensus problem for multi-agent systems has been greatly studied.[1420] It is found that consensus method can be used to deal with formation control problem. The consensus-based method for formation problem has been developed in such as Refs. [12,13,2124]. In Ref. [12], the distributed adaptive time-varying formation control problem for multi-agent systems with fixed topology was introduced. Other relevant researches on formation control under fixed topology can be found in Refs. [2224]. Considering the fact that the interaction topology among agents may change dynamically, formation control for multi-agent systems under switching topologies was addressed in Refs. [11,13], and [21]. Compared with Refs. [13] and [21], the feasibility condition in Ref. [11] is easier to test and the complexity of the proof is reduced.

In most existing formation control strategies, controller always updates continuously. However, such control strategies might be inefficient or impractical in multi-agent systems since they can lead to large communication load and waste excessive resources. Recently, researchers exhibit novel interests on event-triggered control since it is beneficial to coordination of multi-agent systems and can facilitate the efficient usage of the shared resources. In event-triggered control, data transmission or controller actuation times are determined by an event-triggering mechanism. The event-triggered control often depends on a well-defined event-triggering condition in which the measurement error plays an essential role. Many works on event-triggered control for multi-agent systems focused on the consensus problem.[2528] In Refs. [2527], the consensus can be achieved asymptotically via event-triggered control under fixed topology. The consensus problem under switching topologies with event-triggered strategy was studied in Ref. [28]. The event-triggering containment control of multi-agent networks with fixed and switching topologies was investigated in Ref. [29]. In practice, communication delays are inevitable. In Ref. [30], event-triggered tracking control of leader-follower multi-agent systems with communication delays was discussed. However, to our best knowledge, there are few results on time-varying formation problem for multi-agent systems via event-triggered control . This motivates our study.

Motivated by the above considerations, in this paper, we aim at dealing with the time-varying formation problem of multi-agent systems with general linear dynamics via distributed event-triggered control under switching topologies. The contributions of our work are four-fold: (i) The formation is time-varying, which has better flexibility. A feasibility condition for time-varying formation is given. In Ref. [31], the formation is assumed to be fixed. The results for time-invariant formation cannot be directly applied to time-varying formation. And in Ref. [21], the feasibility condition is more difficult to test than ours. (ii) A distributed event-triggered control scheme is designed. For each agent, the controller is triggered only at its own event times. In Refs. [12,13,2124], their controllers are updated continuously, which may lead to large communication load and waste excessive resources. (iii) The interaction topology among agents is switching, which is more practical and challenging than fixed topology. In this case, the formation problem of the multi-agent system is changed into a stabilization problem of a switched system. A common Lyapunov function method is applied, which is more concise than the multiple Lyapunov functions method in Ref. [21]. (iv) It is further shown that the Zeno behavior can be avoided in the distributed event-triggered scheme, which means that two inter-execution instants have a positive lower bound.

The rest of this paper is organized as follows. In Section 2, some preliminaries and the problem formulation are provided. Section 3 presents the main results. The distributed event-triggered control law is designed and the time-varying formation problem under switching topologies is solved via common Lyapunov function method. The Zeno phenomena is further verified to be avoided. To illustrate the theoretical results, an example is shown in Section 4. Finally, Section 5 concludes this paper.

2. Preliminaries and problem formulation
2.1. Graph theory

An undirected graph contains a vertex set , an edge set , and a weighted adjacency matrix , where and . if and only if there is an edge between vertex i and vertex j and the two vertices are called adjacent (or they are mutual neighbors). The set of neighbors of vertex i is denoted by .

Define the Laplacian matrix L with respect to graph as

where the diagonal matrix is called degree matrix with the diagonal elements for .

By the definition, for undirected graph, L is symmetric and every row sum of it is zero. Zero 0 is an eigenvalue of L and is the associated eigenvector, that is, , where . If is undirected and connected, then 0 is the algebraically simple eigenvalue of L and all the other eigenvalues are positive.

2.2. Problem formulation

In this paper, the dynamics of each agent is described by

where are the state and the control input of the i-th agent, , respectively. , are constant matrices and is assumed stabilizable.

We define that the vector is the desired time-varying formation and ( ) is piecewise continuous differentiable. It should be pointed out that is only used to characterize the time-varying formation rather than to provide reference trajectory for each agent to follow (see, e.g., Ref. [9] for more details).

According to the definition of E in Eq. (3), the following property holds immediately.

3. Main results
3.1. Time-varying formation under switching topologies

In this section, we will consider the time-varying formation problem of multi-agent systems by distributed event-triggered control strategy.

We assume the adjacency graph is undirected and connected and the topology structure between agents is switching. Define the switching signal , which is a piecewise constant right continuous function. Assume the switching is arbitrary and are the switching moments of . denotes the topology graph at time t. During the time interval , the graph is fixed. For simplicity, we assume the weights of all the interaction links are time-invariant. That is, when agent , the weight is a constant, where is the neighbors’ set of agent i at time t.

For saving energy, we construct the control law based on event-triggering strategy and assume the triggering mechanism is in the distributed style that the triggering instants are different for each agent. The event-triggering time sequence for agent i is denoted by and denotes the k-th triggering time of agent i.

In event-triggered strategy, agents only update their states at the time when some event conditions are triggered. Therefore, when , only at the triggering instant , the topology graph affects the update of the controller.

Let , . The combinational measurement for agent i is defined as

where is the k-th event-triggering time of agent i.

At time , agent i measures the information of and will keep it unchanged until the next time comes. Therefore, in the time interval , the measurement of agent i is .

The measurement error can be defined as

where is the k-th event-triggering time of agent i, and . For each , is the latest event-triggering instant of agent j.

The event-triggering times for agent i are specified when the following triggering condition

is violated, that is,
where Fq and ρ will be determined later.

Then the distributed control law for agent i is designed as

where K is the feedback gain matrix to be designed.

In the time interval , based on Eqs. (5) and (7), the closed-loop of system (2) is

Denote

where . Then equation (8) can be rewritten as
or the error system

Define , where E is defined in Eq. (3), then , . One has

where , and is the corresponding matrix satisfying . Then we have the following main result.

3.2. Lower bound for inter-event times

In this section, the feasibility of the proposed event-triggered control strategy will be analyzed by excluding the Zeno behavior. We will prove that in the triggering condition (13) the inter-event times for any agent are lower bounded by a strictly positive constant. The inter-event time means the time interval between any two consecutive triggered instants.

4. Numerical simulations

In this section, a numerical example is provided to demonstrate the effectiveness of the results obtained in the previous section. In this example, the multi-agent system consists of four agents satisfying Eq. (2) with ,

These four agents are required to preserve a time-varying quadrangle formation. And the time-varying formation is specified by

Assume the interaction topology between agents is time-varying. Four possible adjacency graphs, denoted by , , , and , are shown in Fig. 1. Clearly, each graph is undirected and connected. The Laplacian matrices of the graphs , , , and are

Fig. 1. Switching graphs with .

The topology graphs are switched according to . The switching signal is shown in Fig. 2, in which the switching duration is arbitrary.

Fig. 2. (color online) Switching signal .

Choose ρ = 1, α = 0.7421, β = 24.7047, ϵ = 2, and . By solving the inequality (12), we obtain the positive definite solution

Then by Theorem 1, the desired time-varying formation can be achieved under the event-triggered control law (7) with and the triggering condition (13).

With the initial values , the time-varying formation can be achieved. Figure 3 displays the errors relative to the desired positions for all agents. The event-triggering conditions of four agents are given in Fig. 4, where the blue line shows the evolution of , which stays below the threshold given by the triggering condition (13). The red line represents the function on the right side of Eq. (13). The controller will be updated when the blue line exceeds the red line. The event-triggering instants of four agents are shown in Fig. 5. One can see that the number of actuator control updates is greatly reduced to reach the desired time-varying formation compared with continuous communication. The position snapshots of four agents at different time are shown in Fig. 6. In Fig. 6(b), four agents reach a quadrangle formation and figure 6(c) and 6(d) show that the quadrangle formation keeps rotation.

Fig. 3. (color online) The errors of four agents.
Fig. 4. (color online) Evolution of the event-triggering conditions.
Fig. 5. (color online) The event-triggering instants.
Fig. 6. (color online) Position snapshots of four agents.
5. Conclusion

In this paper, the time-varying formation problem for general linear multi-agent systems under switching topologies was studied. A distributed event-triggered control scheme was designed, in which the controller was updated only when the event condition was driven. Using this kind of controller, one can prove that the desired time-varying formation can be reached if the communication graph is switching and connected. We also showed that the Zeno behavior can be avoided in the event-triggered control scheme. A simulation example was given to illustrate the effectiveness of the proposed control law.

Future research will focus on the formation problem of multi-agent systems subject to unknown external disturbances and communication delays via sliding mode control.

Reference
[1] Bai H Wen J T 2010 IEEE Trans. Robotics. 26 742
[2] Cao F J Ling Z H Yuan Y F Gao C 2014 Chin. Phys. 23 070509
[3] Yan W S Fang X P Li J B 2014 IEEE Commun. Lett. 18 1579
[4] Zuo Y Z Cichella V Xu M Hovakimyan N 2015 J. Frankl. Inst. 352 3858
[5] Chen L M Li C J Sun Y C Ma G F 2017 Chin. Phys. 26 068703
[6] Ge M F Guan Z H Yang C Li T Wang Y W 2016 Neurocomputing 202 20
[7] Ma C Q Zhang J F 2012 J. Syst. Sci. Complex 25 13
[8] Olfati-Saber R Fax J A Murray M 2007 Proc. IEEE 95 215
[9] Dong X W Yu B C Shi Z Y Zhong Y S 2015 IEEE Trans. Control Syst. Technol. 23 340
[10] Dong X W Shi Z Y Lu G Zhong Y S 2014 IET Control Theory Appl. 8 2162
[11] Liu W LZhou S Qi Y H Yan S 2015 Control Theory and Application 32 1422
[12] Wang R Dong X W Li Q D Zhang R 2016 J. Frankl. Inst. 335 2290
[13] Dong X W Xi J X Lu G Zhong Y S 2014 IEEE Trans. Contr. Network Systems 1 232
[14] Qiu Z R Liu S Xie L H 2016 Automatica 68 209
[15] Cheng L Wang Y P Hou Z G Tan M 2016 IEEE Trans. Auto. Contr. 61 3586
[16] Ai X D Song S J You K Y 2016 Automatica 68 329
[17] Li Z K Chen Z Q Ding Z T 2016 Automatica 68 179
[18] Zhang X Wang J H Yang D D Xu Y 2017 Chin. Phys. 26 070501
[19] Li Z K Duan Z S Ren W Feng G 2015 Inter. J. Robust and Nonlinear Control 25 2101
[20] Li Z K Ren W Liu X D Xie L H 2013 Automatica 49 1986
[21] Dong X W Hu G Q 2016 Automatica 73 47
[22] Mawwary M 2015 Automatica 54 374
[23] Oh K Park M Ahn H 2015 Automatica 53 424
[24] Yoo S Kim T 2015 Automatica 54 100
[25] Cao J Wu Z H Peng L 2016 Chin. Phys. 25 058902
[26] Hu W F Liu L Feng G 2016 IEEE Trans. Cybernetics 46 148
[27] Zhang H Feng G Yan H C Chen Q J 2014 IEEE Trans. Industrial Electronics 61 4485
[28] Yang R H Zhang H Yan H C 2017 Acta Autom. Sin. 43 472
[29] Zhang W B Yang T Liu Y R Kurths J 2017 IEEE Trans. Circuits and Systems I: Regular Papers 64 619
[30] Hu J Chen G Li H X 2011 Kybernetika 47 630
[31] Tang T Hiu Z X Chen Z Q 2011 Chinese Control Conference 4783
[32] Ni W Zhao P Wang X L Wang J H 2015 Asian J. Contr. 17 1196
[33] Liu W Zhou S L Qi Y H Wu X Z 2016 Neurocomputing 173 1322
[34] Horn R A Johnson C R 1985 Matrix Analysis Cambridge Cambridge University Press